Exact Non-identity check is NQP-complete
نویسنده
چکیده
We define a problem “exact non-identity check”: Given a classical description of a quantum circuit with an ancilla system, determine whether it is strictly equivalent to the identity or not. We show that this problem is NQP-complete. In a sense of the strict equivalence condition, this problem is different from a QMA-complete problem, non-identity check defined in [1]. As corollaries, it is derived that exact equivalence check is also NQP-complete and that it is hard to minimize quantum resources of a given quantum gate array without changing an implemented unitary operation.
منابع مشابه
Non-Identity Check Remains QMA-Complete for Short Circuits
The Non-Identity Check problem asks whether a given a quantum circuit is far away from the identity or not. It is well known that this problem is QMA-Complete [14]. In this note, it is shown that the Non-Identity Check problem remains QMA-Complete for circuits of short depth. Specifically, we prove that for constant depth quantum circuit in which each gate is given to at least Ω(log n) bits of ...
متن کاملQuantum Np Is Hard for Ph
In analogy with NP, a language L is in the class NQP if the strings in L are exactly those accepted by a polynomial-time quantum machine with non-zero probability. Previously, Adleman, Demarrais and Huang showed that NQP PP. The sharper upper bound NQP coC=P is implicit in Adleman et al. and results of Fortnow and Rogers. Here we prove that in fact NQP and coC=P are the same class, by showing t...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملNQP = co-C=P
Adleman, Demarrais, and Huang introduced the nondeterministic quantum polynomial-time complexity class NQP as an analogue of NP. It is known that, with restricted amplitudes, NQP is characterized in terms of the classical counting complexity class C=P. In this paper we prove that, with unrestricted amplitudes, NQP indeed coincides with the complement of C=P. As an immediate corollary, with unre...
متن کامل05 05 0 v 1 9 M ay 2 00 3 “ Identity check ” is QMA - complete
We define the problem “identity check”: Given a classical description of a quantum circuit, determine whether it is almost equivalent to the identity. Explicitly, the task is to decide whether the corresponding unitary is close to a complex multiple of the identity matrix with respect to the operator norm. We show that this problem is QMA-complete. A generalization of this problem is “equivalen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009